Kopparty, S.: search on Z-Library

The world's largest scientific articles store. 70,000,000+ articles for free.

Don't use scam websites

1

[IEEE GLOBECOM 2002 - IEEE Global Communications Conference - Taipei, Taiwan (17-21 Nov. 2002)] Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE - Split TCP for mobile ad hoc networks

Kopparty, S., Krishnamurthy, S.V., Faloutsos, M., Tripathi, S.K.

Year:

2002

Language:

english

File:

PDF, 378 KB

english, 2002

2

A framework for pursuit evasion games in

Swastik Kopparty, Chinya V. Ravishankar

Journal:

Information Processing Letters

Year:

2005

Language:

english

File:

PDF, 147 KB

english, 2005

3

High-rate codes with sublinear-time decoding

Kopparty, Swastik, Saraf, Shubhangi, Yekhanin, Sergey

Journal:

Journal of the ACM

Year:

2014

Language:

english

File:

PDF, 180 KB

english, 2014

4

Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers

Dvir, Zeev, Kopparty, Swastik, Saraf, Shubhangi, Sudan, Madhu

Journal:

SIAM Journal on Computing

Year:

2013

Language:

english

File:

PDF, 539 KB

english, 2013

5

Equivalence of Polynomial Identity Testing and Polynomial Factorization

Kopparty, Swastik, Saraf, Shubhangi, Shpilka, Amir

Journal:

Computational Complexity

Year:

2015

Language:

english

File:

PDF, 474 KB

english, 2015

6

The minimum rank problem: A counterexample

Swastik Kopparty, K.P.S. Bhaskara Rao

Journal:

Linear Algebra and its Applications

Year:

2008

Language:

english

File:

PDF, 100 KB

english, 2008

7

Kakeya-type sets in finite vector spaces

Swastik Kopparty, Vsevolod F. Lev, Shubhangi Saraf, Madhu Sudan

Journal:

Journal of Algebraic Combinatorics

Year:

2011

Language:

english

File:

PDF, 614 KB

english, 2011

8

[ACM Press the 42nd ACM symposium - Cambridge, Massachusetts, USA (2010.06.05-2010.06.08)] Proceedings of the 42nd ACM symposium on Theory of computing - STOC '10 - Local list-decoding and testing of random linear codes from high error

Kopparty, Swastik, Saraf, Shubhangi

Year:

2010

Language:

english

File:

PDF, 592 KB

english, 2010

9

[ACM Press the 40th annual ACM symposium - Victoria, British Columbia, Canada (2008.05.17-2008.05.20)] Proceedings of the fourtieth annual ACM symposium on Theory of computing - STOC 08 - Decodability of group homomorphisms beyond the johnson bound

Dinur, Irit, Grigorescu, Elena, Kopparty, Swastik, Sudan, Madhu

Year:

2008

Language:

english

File:

PDF, 294 KB

english, 2008

10

The homomorphism domination exponent

Swastik Kopparty, Benjamin Rossman

Journal:

European Journal of Combinatorics

Year:

2011

Language:

english

File:

PDF, 376 KB

english, 2011

11

Subspace Polynomials and Limits to List Decoding of Reed–Solomon Codes

Ben-Sasson, E., Kopparty, S., Radhakrishnan, J.

Journal:

IEEE Transactions on Information Theory

Year:

2010

Language:

english

File:

PDF, 303 KB

english, 2010

12

On the List-Decodability of Random Linear Codes

Guruswami, V., Håstad, J., Kopparty, S.

Journal:

IEEE Transactions on Information Theory

Year:

2011

Language:

english

File:

PDF, 234 KB

english, 2011

13

Affine Dispersers from Subspace Polynomials

Ben-Sasson, Eli, Kopparty, Swastik

Journal:

SIAM Journal on Computing

Year:

2012

Language:

english

File:

PDF, 429 KB

english, 2012

14

[ACM Press the ACM SIGMETRICS/international conference - Pittsburgh, PA, USA (2013.06.17-2013.06.21)] Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems - SIGMETRICS '13 - The design space of probing algorithms for network-performance measurement

Jaggard, Aaron D., Kopparty, Swara, Ramachandran, Vijay, Wright, Rebecca N.

Year:

2013

Language:

english

File:

PDF, 1.70 MB

english, 2013

15

Voluntary Retirement: Problems and Prospects of Rehabilitationby B. P. Guha

Review by: S. N. M. Kopparty

Journal:

Indian Journal of Industrial Relations

Year:

1997

Language:

english

File:

PDF, 336 KB

english, 1997

16

[IEEE 2008 23rd Annual IEEE Conference on Computational Complexity - College Park, MD, USA (2008.06.23-2008.06.26)] 2008 23rd Annual IEEE Conference on Computational Complexity - Detecting Rational Points on Hypersurfaces over Finite Fields

Kopparty, Swastik, Yekhanin, Sergey

Year:

2008

Language:

english

File:

PDF, 359 KB

english, 2008

17

[IEEE Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications - Barcelona, Spain (2006.04.23-2006.04.29)] Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications - How to Construct a Correct and Scalable iBGP Configuration

Vutukuru, M., Valiant, P., Kopparty, S., Balakrishnan, H.

Year:

2006

Language:

english

File:

PDF, 231 KB

english, 2006

18

[IEEE 2009 IEEE 50th Annual Symposium on Foundations of Computer Science (FOCS) - Atlanta, GA, USA (2009.10.25-2009.10.27)] 2009 50th Annual IEEE Symposium on Foundations of Computer Science - Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers

Dvir, Zeev, Kopparty, Swastik, Saraf, Shubhangi, Sudan, Madhu

Year:

2009

Language:

english

File:

PDF, 328 KB

english, 2009

19

[IEEE 2010 IEEE 51st Annual Symposium on Foundations of Computer Science (FOCS) - Las Vegas, NV, USA (2010.10.23-2010.10.26)] 2010 IEEE 51st Annual Symposium on Foundations of Computer Science - Optimal Testing of Reed-Muller Codes

Bhattacharyya, Arnab, Kopparty, Swastik, Schoenebeck, Grant, Sudan, Madhu, Zuckerman, David

Year:

2010

Language:

english

File:

PDF, 667 KB

english, 2010

20

[IEEE 2009 24th Annual IEEE Conference on Computational Complexity (CCC) - Paris, France (2009.07.15-2009.07.18)] 2009 24th Annual IEEE Conference on Computational Complexity - On the Communication Complexity of Read-Once AC^0 Formulae

Jayram, T.S., Kopparty, Swastik, Raghavendra, Prasad

Year:

2009

Language:

english

File:

PDF, 418 KB

english, 2009

21

[IEEE 2013 IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS) - Berkeley, CA, USA (2013.10.26-2013.10.29)] 2013 IEEE 54th Annual Symposium on Foundations of Computer Science - Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity

Ben-Sasson, Eli, Kaplan, Yohay, Kopparty, Swastik, Meir, Or, Stichtenoth, Henning

Year:

2013

Language:

english

File:

PDF, 267 KB

english, 2013

22

[IEEE 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) - Berkeley, CA, USA (2006.10.21-2006.10.24)] 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) - Subspace Polynomials and List Decoding of Reed-Solomon Codes

Ben-Sasson, Eli, Kopparty, Swastik, Radhakrishnan, Jaikumar

Year:

2006

Language:

english

File:

PDF, 273 KB

english, 2006

23

[IEEE 2014 IEEE Conference on Computational Complexity (CCC) - Vancouver, BC, Canada (2014.6.11-2014.6.13)] 2014 IEEE 29th Conference on Computational Complexity (CCC) - Equivalence of Polynomial Identity Testing and Deterministic Multivariate Polynomial Factorization

Kopparty, Swastik, Saraf, Shubhangi, Shpilka, Amir

Year:

2014

Language:

english

File:

PDF, 258 KB

english, 2014

24

[IEEE 2013 IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS) - Berkeley, CA, USA (2013.10.26-2013.10.29)] 2013 IEEE 54th Annual Symposium on Foundations of Computer Science - Explicit Subspace Designs

Guruswami, Venkatesan, Kopparty, Swastik

Year:

2013

Language:

english

File:

PDF, 284 KB

english, 2013

25

[ACM Press the 43rd annual ACM symposium - San Jose, California, USA (2011.06.06-2011.06.08)] Proceedings of the 43rd annual ACM symposium on Theory of computing - STOC '11 - High-rate codes with sublinear-time decoding

Kopparty, Swastik, Saraf, Shubhangi, Yekhanin, Sergey

Year:

2011

Language:

english

File:

PDF, 632 KB

english, 2011

26

Local List-Decoding and Testing of Random Linear Codes from High Error

Kopparty, Swastik, Saraf, Shubhangi

Journal:

SIAM Journal on Computing

Year:

2013

Language:

english

File:

PDF, 314 KB

english, 2013

27

[IEEE 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) - Monticello, IL, USA (2009.09.30-2009.10.2)] 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) - Universal capacity of channels with given rate-distortion in absence of common randomness, and failure of universal source-channel separation

Agarwal, Mukul, Kopparty, Swastik, Mitter, Sanjoy

Year:

2009

Language:

english

File:

PDF, 229 KB

english, 2009

28

[ACM Press the 45th annual ACM symposium - Palo Alto, California, USA (2013.06.01-2013.06.04)] Proceedings of the 45th annual ACM symposium on Symposium on theory of computing - STOC '13 - A new family of locally correctable codes based on degree-lifted algebraic geometry codes

Ben-Sasson, Eli, Gabizon, Ariel, Kaplan, Yohay, Kopparty, Swastik, Saraf, Shubangi

Year:

2013

Language:

english

File:

PDF, 498 KB

english, 2013

29

Explicit subspace designs

Guruswami, Venkatesan, Kopparty, Swastik

Journal:

Year:

2016

Language:

english

File:

PDF, 481 KB

english, 2016

30

[ACM Press the 42nd ACM symposium - Cambridge, Massachusetts, USA (2010.06.05-2010.06.08)] Proceedings of the 42nd ACM symposium on Theory of computing - STOC '10 - On the list-decodability of random linear codes

Guruswami, Venkatesan, Hastad, Johan, Kopparty, Swastik

Year:

2010

Language:

english

File:

PDF, 598 KB

english, 2010

31

[ACM Press the 43rd annual ACM symposium - San Jose, California, USA (2011.06.06-2011.06.08)] Proceedings of the 43rd annual ACM symposium on Theory of computing - STOC '11 - On the complexity of powering in finite fields

Kopparty, Swastik

Year:

2011

Language:

english

File:

PDF, 620 KB

english, 2011

32

[ACM Press the 41st annual ACM symposium - Bethesda, MD, USA (2009.05.31-2009.06.02)] Proceedings of the 41st annual ACM symposium on Symposium on theory of computing - STOC '09 - Random graphs and the parity quantifier

Kolaitis, Phokion G., Kopparty, Swastik

Year:

2009

Language:

english

File:

PDF, 535 KB

english, 2009

33

Random graphs and the parity quantifier

Kolaitis, Phokion G., Kopparty, Swastik

Journal:

Journal of the ACM

Year:

2013

Language:

english

File:

PDF, 333 KB

english, 2013

34

The design space of probing algorithms for network-performance measurement

Jaggard, Aaron D., Kopparty, Swara, Ramachandran, Vijay, Wright, Rebecca N.

Journal:

ACM SIGMETRICS Performance Evaluation Review

Year:

2013

Language:

english

File:

PDF, 1.70 MB

english, 2013

35

New affine-invariant codes from lifting

A. Guo, S. Kopparty, M. Sudan

Year:

2013

Language:

english

File:

PDF, 523 KB

english, 2013

36

[ACM Press the 41st annual ACM symposium - Bethesda, MD, USA (2009.05.31-2009.06.02)] Proceedings of the 41st annual ACM symposium on Symposium on theory of computing - STOC '09 - Affine dispersers from subspace polynomials

Ben-Sasson, Eli, Kopparty, Swastik

Year:

2009

Language:

english

File:

PDF, 519 KB

english, 2009

37

List-decoding algorithms for lifted codes

Guo, Alan, Kopparty, Swastik

Journal:

IEEE Transactions on Information Theory

Year:

2016

Language:

english

File:

PDF, 627 KB

english, 2016

38

Quality of Life of Patients with Cancer: A Determinant of the Quality of Life of Their Family Caregivers

Padmaja, Gadiraju, Vanlalhruaii, C., Rana, Suvashisa, Tiamongla,, Kopparty, Swarajya

Journal:

Journal of Cancer Education

Year:

2016

Language:

english

File:

PDF, 329 KB

english, 2016

39

Acceptance in the family: a study of deformed and non‐deformed leprosy patients in Tamil Nadu, India

Kopparty, S.N.M.

Journal:

International Journal of Sociology and Social Policy

Year:

1998

Language:

english

File:

PDF, 208 KB

english, 1998

40

A local central limit theorem for triangles in a random graph

Gilmer, Justin, Kopparty, Swastik

Journal:

Random Structures & Algorithms

Year:

2016

Language:

english

File:

PDF, 167 KB

english, 2016

41

[ACM Press the 48th Annual ACM SIGACT Symposium - Cambridge, MA, USA (2016.06.19-2016.06.21)] Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2016 - High-rate locally-correctable and locally-testable codes with sub-polynomial query complexity

Kopparty, Swastik, Meir, Or, Ron-Zewi, Noga, Saraf, Shubhangi

Year:

2016

Language:

english

File:

PDF, 447 KB

english, 2016

42

High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity

Kopparty, Swastik, Meir, Or, Ron-Zewi, Noga, Saraf, Shubhangi

Journal:

Journal of the ACM

Year:

2017

Language:

english

File:

PDF, 486 KB

english, 2017

43

Locally Testable and Locally Correctable Codes approaching the Gilbert-Varshamov Bound

Gopi, Sivakanth, Kopparty, Swastik, Oliveira, Rafael, Ron-Zewi, Noga, Saraf, Shubhangi

Journal:

IEEE Transactions on Information Theory

Year:

2018

Language:

english

File:

PDF, 560 KB

english, 2018

44

[Society for Industrial and Applied Mathematics Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms - ()] Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms - Robust positioning patterns

Berkowitz, Ross, Kopparty, Swastik

Language:

english

File:

PDF, 225 KB

english

45

[IEEE 2018 IEEE Wireless Communications and Networking Conference (WCNC) - Barcelona, Spain (2018.4.15-2018.4.18)] 2018 IEEE Wireless Communications and Networking Conference (WCNC) - Efficient methods for bearer traffic flow migration in NG-RAN

Kopparty, Vijaykrishna, Manjunath, V, Subramaniam, Karthikeyan, Jain, Prerit, Gadag, Veerabhadrappa M

Year:

2018

Language:

english

File:

PDF, 546 KB

english, 2018

46

Spring School on Language, Music, and Cognition

Asano, Rie, Bornus, Pia, Craft, Justin T., Dolscheid, Sarah, Faber, Sarah E. M., Haase, Viviana, Heimerich, Marvin, Kopparti, Radha, Lobben, Marit, Osawa, Ayumi M., Oudyk, Kendra, Trettenbrein, Patric

Journal:

Music & Science

Year:

2018

Language:

english

File:

PDF, 344 KB

english, 2018

47

[Society for Industrial and Applied Mathematics Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms - ()] Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms - Maximally Recoverable Codes for Grid-like Topologies

Gopalan, Parikshit, Hu, Guangda, Kopparty, Swastik, Saraf, Shubhangi, Wang, Carol, Yekhanin, Sergey

Language:

english

File:

PDF, 444 KB

english

48

On strictly nonzero integer-valued charges

Kopparty, Swastik, Rao, K. P. S. Bhaskara

Journal:

Proceedings of the American Mathematical Society

Year:

2018

File:

PDF, 200 KB

2018

49

[IEEE 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) - Paris (2018.10.7-2018.10.9)] 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) - Improved Decoding of Folded Reed-Solomon and Multiplicity Codes

Kopparty, Swastik, Ron-Zewi, Noga, Saraf, Shubhangi, Wootters, Mary

Year:

2018

Language:

english

File:

PDF, 253 KB

english, 2018

50

[IEEE 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS) - Baltimore, MD, USA (2019.11.9-2019.11.12)] 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS) - Quasilinear Time List-Decodable Codes for Space Bounded Channels

Silbak, Jad, Kopparty, Swastik, Shaltiel, Ronen

Year:

2019

File:

PDF, 10.98 MB

2019

To build up a library is to create a life. It’s never just a random collection of books.

— Carlos María Domínguez

Official channel

Z-Library Desktop Launcher

Z-Library Since 2009 support@z-lib.do

EnglishРусскийEspañolItalianoελληνικάاللغة العربيةBahasa IndonesiaBahasa Malaysiaहिन्दीDeutschFrançaisPortuguêsУкраїнськаPolski中文繁體中文日本語Tiếng ViệtAzərbaycan DiliՀայոց լեզուภาษาไทยTürk Diliქართველიবাংলাپښتوతెలుగుاردو한국어SrpskiБългарски